TSTP Solution File: NUM686^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM686^1 : TPTP v8.1.2. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 08:56:15 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of formulae : 33 ( 4 unt; 8 typ; 0 def)
% Number of atoms : 80 ( 3 equ; 0 cnn)
% Maximal formula atoms : 6 ( 3 avg)
% Number of connectives : 223 ( 14 ~; 11 |; 0 &; 192 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 8 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 63 ( 22 ^ 41 !; 0 ?; 63 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
nat: $tType ).
thf(decl_22,type,
x: nat ).
thf(decl_23,type,
y: nat ).
thf(decl_24,type,
z: nat ).
thf(decl_25,type,
u: nat ).
thf(decl_26,type,
some: ( nat > $o ) > $o ).
thf(decl_27,type,
diffprop: nat > nat > nat > $o ).
thf(decl_28,type,
pl: nat > nat > nat ).
thf(satz19a,axiom,
! [X3: nat,X4: nat,X5: nat] :
( ( some
@ ^ [X1: nat] : ( diffprop @ X3 @ X4 @ X1 ) )
=> ( some
@ ^ [X1: nat] : ( diffprop @ ( pl @ X3 @ X5 ) @ ( pl @ X4 @ X5 ) @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.DDfPf1NTIV/E---3.1_21291.p',satz19a) ).
thf(satz15,axiom,
! [X3: nat,X4: nat,X5: nat] :
( ( some
@ ^ [X6: nat] : ( diffprop @ X4 @ X3 @ X6 ) )
=> ( ( some
@ ^ [X6: nat] : ( diffprop @ X5 @ X4 @ X6 ) )
=> ( some
@ ^ [X6: nat] : ( diffprop @ X5 @ X3 @ X6 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.DDfPf1NTIV/E---3.1_21291.p',satz15) ).
thf(satz6,axiom,
! [X3: nat,X4: nat] :
( ( pl @ X3 @ X4 )
= ( pl @ X4 @ X3 ) ),
file('/export/starexec/sandbox/tmp/tmp.DDfPf1NTIV/E---3.1_21291.p',satz6) ).
thf(satz21,conjecture,
( some
@ ^ [X2: nat] : ( diffprop @ ( pl @ x @ z ) @ ( pl @ y @ u ) @ X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.DDfPf1NTIV/E---3.1_21291.p',satz21) ).
thf(m,axiom,
( some
@ ^ [X1: nat] : ( diffprop @ x @ y @ X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.DDfPf1NTIV/E---3.1_21291.p',m) ).
thf(n,axiom,
( some
@ ^ [X2: nat] : ( diffprop @ z @ u @ X2 ) ),
file('/export/starexec/sandbox/tmp/tmp.DDfPf1NTIV/E---3.1_21291.p',n) ).
thf(c_0_6,plain,
! [X3: nat,X4: nat,X5: nat] :
( ( some
@ ^ [Z0: nat] : ( diffprop @ X3 @ X4 @ Z0 ) )
=> ( some
@ ^ [Z0: nat] : ( diffprop @ ( pl @ X3 @ X5 ) @ ( pl @ X4 @ X5 ) @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[satz19a]) ).
thf(c_0_7,plain,
! [X3: nat,X4: nat,X5: nat] :
( ( some
@ ^ [Z0: nat] : ( diffprop @ X4 @ X3 @ Z0 ) )
=> ( ( some
@ ^ [Z0: nat] : ( diffprop @ X5 @ X4 @ Z0 ) )
=> ( some
@ ^ [Z0: nat] : ( diffprop @ X5 @ X3 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[satz15]) ).
thf(c_0_8,plain,
! [X18: nat,X19: nat,X20: nat] :
( ~ ( some
@ ^ [Z0: nat] : ( diffprop @ X18 @ X19 @ Z0 ) )
| ( some
@ ^ [Z0: nat] : ( diffprop @ ( pl @ X18 @ X20 ) @ ( pl @ X19 @ X20 ) @ Z0 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
thf(c_0_9,plain,
! [X21: nat,X22: nat] :
( ( pl @ X21 @ X22 )
= ( pl @ X22 @ X21 ) ),
inference(variable_rename,[status(thm)],[satz6]) ).
thf(c_0_10,plain,
! [X15: nat,X16: nat,X17: nat] :
( ~ ( some
@ ^ [Z0: nat] : ( diffprop @ X16 @ X15 @ Z0 ) )
| ~ ( some
@ ^ [Z0: nat] : ( diffprop @ X17 @ X16 @ Z0 ) )
| ( some
@ ^ [Z0: nat] : ( diffprop @ X17 @ X15 @ Z0 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
thf(c_0_11,plain,
! [X1: nat,X3: nat,X2: nat] :
( ( some @ ( diffprop @ ( pl @ X1 @ X3 ) @ ( pl @ X2 @ X3 ) ) )
| ~ ( some @ ( diffprop @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
! [X2: nat,X1: nat] :
( ( pl @ X1 @ X2 )
= ( pl @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_13,negated_conjecture,
~ ( some
@ ^ [Z0: nat] : ( diffprop @ ( pl @ x @ z ) @ ( pl @ y @ u ) @ Z0 ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz21])])]) ).
thf(c_0_14,plain,
! [X3: nat,X2: nat,X1: nat] :
( ( some @ ( diffprop @ X3 @ X2 ) )
| ~ ( some @ ( diffprop @ X1 @ X2 ) )
| ~ ( some @ ( diffprop @ X3 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_15,plain,
! [X1: nat,X2: nat,X3: nat] :
( ( some @ ( diffprop @ ( pl @ X1 @ X2 ) @ ( pl @ X2 @ X3 ) ) )
| ~ ( some @ ( diffprop @ X1 @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_16,negated_conjecture,
~ ( some
@ ^ [Z0: nat] : ( diffprop @ ( pl @ x @ z ) @ ( pl @ y @ u ) @ Z0 ) ),
inference(fof_nnf,[status(thm)],[c_0_13]) ).
thf(c_0_17,plain,
! [X1: nat,X3: nat,X2: nat,X4: nat] :
( ( some @ ( diffprop @ ( pl @ X1 @ X2 ) @ X3 ) )
| ~ ( some @ ( diffprop @ ( pl @ X2 @ X4 ) @ X3 ) )
| ~ ( some @ ( diffprop @ X1 @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_18,plain,
( some
@ ^ [Z0: nat] : ( diffprop @ x @ y @ Z0 ) ),
inference(fof_simplification,[status(thm)],[m]) ).
thf(c_0_19,plain,
( some
@ ^ [Z0: nat] : ( diffprop @ z @ u @ Z0 ) ),
inference(fof_simplification,[status(thm)],[n]) ).
thf(c_0_20,negated_conjecture,
~ ( some @ ( diffprop @ ( pl @ x @ z ) @ ( pl @ y @ u ) ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_21,plain,
! [X1: nat,X2: nat,X3: nat,X4: nat] :
( ( some @ ( diffprop @ ( pl @ X1 @ X2 ) @ ( pl @ X3 @ X4 ) ) )
| ~ ( some @ ( diffprop @ X1 @ X3 ) )
| ~ ( some @ ( diffprop @ X2 @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
thf(c_0_22,plain,
some @ ( diffprop @ x @ y ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_23,plain,
some @ ( diffprop @ z @ u ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : NUM686^1 : TPTP v8.1.2. Released v3.7.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 09:39:47 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.DDfPf1NTIV/E---3.1_21291.p
% 0.20/0.50 # Version: 3.1.0-ho
% 0.20/0.50 # partial match(1): HSMSSMSSSSSNSSN
% 0.20/0.50 # Preprocessing class: HSMSSMSSSSLNSSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_11 with 1500s (5) cores
% 0.20/0.50 # Starting sh5l with 300s (1) cores
% 0.20/0.50 # Starting new_ho_9 with 300s (1) cores
% 0.20/0.50 # Starting ho_unfolding_4 with 300s (1) cores
% 0.20/0.50 # new_ho_11 with pid 21410 completed with status 0
% 0.20/0.50 # Result found by new_ho_11
% 0.20/0.50 # partial match(1): HSMSSMSSSSSNSSN
% 0.20/0.50 # Preprocessing class: HSMSSMSSSSLNSSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_11 with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HHUSF-FFSF22-SSSFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting new_ho_10 with 811s (1) cores
% 0.20/0.50 # Starting new_ho_11 with 151s (1) cores
% 0.20/0.50 # Starting new_bool_1 with 136s (1) cores
% 0.20/0.50 # Starting new_bool_2 with 136s (1) cores
% 0.20/0.50 # Starting new_bool_9 with 136s (1) cores
% 0.20/0.50 # new_ho_10 with pid 21417 completed with status 0
% 0.20/0.50 # Result found by new_ho_10
% 0.20/0.50 # partial match(1): HSMSSMSSSSSNSSN
% 0.20/0.50 # Preprocessing class: HSMSSMSSSSLNSSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_11 with 1500s (5) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HHUSF-FFSF22-SSSFFFNN
% 0.20/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.50 # Starting new_ho_10 with 811s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 14
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 14
% 0.20/0.50 # Removed in clause preprocessing : 8
% 0.20/0.50 # Initial clauses in saturation : 6
% 0.20/0.50 # Processed clauses : 57
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 24
% 0.20/0.50 # ...remaining for further processing : 33
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 0
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 163
% 0.20/0.50 # ...of the previous two non-redundant : 158
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 0
% 0.20/0.50 # Paramodulations : 163
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 2
% 0.20/0.50 # ...of those cached : 0
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 27
% 0.20/0.50 # Positive orientable unit clauses : 2
% 0.20/0.50 # Positive unorientable unit clauses: 1
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 23
% 0.20/0.50 # Current number of unprocessed clauses: 104
% 0.20/0.50 # ...number of literals in the above : 300
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 6
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 287
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 287
% 0.20/0.50 # Non-unit clause-clause subsumptions : 24
% 0.20/0.50 # Unit Clause-clause subsumption calls : 0
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 57
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 3268
% 0.20/0.50 # Search garbage collected termcells : 118
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.008 s
% 0.20/0.50 # System time : 0.001 s
% 0.20/0.50 # Total time : 0.009 s
% 0.20/0.50 # Maximum resident set size: 1784 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.020 s
% 0.20/0.50 # System time : 0.009 s
% 0.20/0.50 # Total time : 0.029 s
% 0.20/0.50 # Maximum resident set size: 1732 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------